Statistical Mechanics of Surjective Cellular Automata

نویسندگان

  • Jarkko Kari
  • Siamak Taati
چکیده

Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. Characterizing all the invariant measures of a cellular automaton could be challenging. Nevertheless, we establish a connection between the invariance of Gibbs measures (used in statistical mechanics to describe thermodynamic equilibrium) and the conservation of additive quantities in surjective cellular automata. Namely, we show that the simplex of shift-invariant Gibbs measures associated to a Hamiltonian is invariant under a surjective cellular automaton if and only if the cellular automaton conserves the Hamiltonian. A special case is the uniform Bernoulli measure, which is well known to be invariant under every surjective cellular automaton, and which corresponds to the conservation of the trivial Hamiltonian. As an application, we obtain that strongly transitive cellular automata have no invariant Gibbs measures other than the uniform Bernoulli measure. Another result is that a one-dimensional reversible cellular automaton that has a positively expansive transpose cannot preserve any full-support Markov measure other than the uniform Bernoulli measure. A general description of approach to equilibrium in reversible cellular automata is missing, but we speculate on the relevance of the randomization property of algebraic cellular automata (as suggested by others), and pose several open questions. As an aside, it turns out that a shift-invariant pre-image of a Gibbs measure under a preinjective factor map between shifts of finite type is always a Gibbs measure. We provide a sufficient condition under which the image of a Gibbs measure under a pre-injective factor map is not a Gibbs measure. We hint on a possible application of pre-injective factor maps in the study of phase transitions in statistical mechanical models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An "almost dual" to Gottschalk's Conjecture

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injec...

متن کامل

Strictly Temporally Periodic Points in Cellular Automata

We study the set of strictly temporally periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but are not spatially periodic. This set turns out to be residual for equicontinuous surjective cellular automata, dense for almost equicontinuous surjective cellular automata, while it is empty for the positively expa...

متن کامل

Post-surjectivity and balancedness of cellular automata over groups

We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every preimage of one is asymptotic to a preimage of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injecti...

متن کامل

Conservation Laws and Invariant Measures in Surjective Cellular Automata

We discuss a close link between two seemingly different topics studied in the cellular automata literature: additive conservation laws and invariant probability measures. We provide an elementary proof of a simple correspondence between invariant full-support Bernoulli measures and interaction-free conserved quantities in the case of onedimensional surjective cellular automata. We also discuss ...

متن کامل

On a Characterization of Locally Finite Groups in Terms of Linear Cellular Automata

We prove that a group G is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over G is injective.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013